The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
نویسندگان
چکیده
The path, the wheelbarrow, and the bicycle inequalities have been shown by Cornuéjols, Fonlupt, and Naddef to be facetdefining for the graphical relaxation of STSP n , the polytope of the symmetric traveling salesman problem on an n-node complete graph. We show that these inequalities, and some generalizations of them, define facets also for STSP n . In conclusion, we characterize a large family of facet-defining inequalities for STSP n that include, as special cases, most of the inequalities currently known to have this property as the comb, the clique tree, and the chain inequalities. Most of the results given here come from a strong relationship of STSP n with its graphical relaxation that we have pointed out in another paper, where the basic proof techniques are also described.
منابع مشابه
On the graphical relaxation of the symmetric traveling salesman polytope
Abstract. The Graphical Traveling Salesman Polyhedron (GTSP) has been proposed by Naddef and Rinaldi to be viewed as a relaxation of the Symmetric Traveling Salesman Polytope (STSP). It has also been employed by Applegate, Bixby, Chvátal, and Cook for solving the latter to optimality by the Branch-and-Cut method. There is a close natural connection between the two polyhedra. Until now, it was n...
متن کاملNew facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on an incomplete graph with 2n vertices, no method was available until recently for using this correspondence to derive facets of the symmetric traveling salesman polytope from facets of the asymmetric one. In this paper w...
متن کاملOn the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra
The Symmetric Traveling Salesman Polytope Sn for a fixed number n of cities is a face of the corresponding Graphical Traveling Salesman Polyhedron Pn. This has been used to study facets of Sn using Pn as a tool. In this paper, we study the operation of “rotating” (or “lifting”) valid inequalities for Sn to obtain a valid inequalities for Pn. As an application, we describe a surprising relations...
متن کاملOn the Parsimonious Property of Relaxations of the Symmetric Traveling Salesman Polytope
We relate the parsimonious property of relaxations of the Symmetric Traveling Salesman Polytope to a connectivity property of the ridge graph of the Graphical Traveling Salesman Polyhedron. This relationship is quite surprising. The proof is elegant and geometric: it makes use of recent results on “flattening” parts of the boundary complex of the polar of the Graphical Traveling Salesman Polyhe...
متن کاملNot Every GTSP Facet Induces an STSP Facet
The graphical traveling salesman problem (GTSP) has been studied as a variant of the classical symmetric traveling salesman problem (STSP) suited particularly for sparse graphs. In addition, it can be viewed as a relaxation of the STSP and employed for solving the latter to optimality as originally proposed by Naddef and Rinaldi. There is a close natural connection between the two associated po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Oper. Res.
دوره 32 شماره
صفحات -
تاریخ انتشار 2007